Randomized mutual exclusion with sub-logarithmic RMR-complexity
نویسندگان
چکیده
منابع مشابه
RMR-Efficient Randomized Abortable Mutual Exclusion
Recent research on mutual exclusion for shared-memory systems has focused on local spinalgorithms. Performance is measured using the remote memory references (RMRs) metric. Ascommon in recent literature, we consider a standard asynchronous shared memory model withN processes, which allows atomic read, write and compare-and-swap (short: CAS) operations.In such a model, the asympt...
متن کاملTight RMR Lower Bounds for Mutual Exclusion
We investigate the remote memory references (RMRs) complexity of deterministic processes that communicate by reading and writing shared memory in asynchronous cache-coherent and distributed shared-memory multiprocessors. We define a class of algorithms that we call order encoding. By applying information-theoretic arguments, we prove that every order encoding algorithm, shared by n processes, h...
متن کاملUsing Delays to Improve RMR Time Complexity in Mutual Exclusion Algorithms
We consider the time complexity of shared-memory mutual exclusion algorithms under the remote-memory-reference (RMR)time measure. In particular, algorithms based on reads, writes, and comparison primitives are considered. For such algorithms,a lower bound of Ω(log N/ log log N) RMRs per critical-section entry has been established in previous work, where N is thenumber of processes. ...
متن کاملSub-logarithmic Randomized Loose Renaming
Renaming is a classic distributed coordination task in which a set of processes must pick distinct identifiers from a small namespace. In this paper, we consider the time complexity of this problem when the namespace is linear in the number of participants, a variant known as loose renaming. We give a non-adaptive algorithm withO(log logn) (individual) step complexity, where n is a known upper ...
متن کاملA Solution to k-Exclusion with O(log k) RMR Complexity
We specify and prove an algorithm solving k-Exclusion, a generalization of the Mutual Exclusion problem. k-Exclusion requires that at most k processes be in the Critical Section (CS) at once; in addition, we require bounded exit, starvation freedom and fairness properties. The goal within this framework is to minimize the number of Remote Memory References (RMRs) made. Previous algorithms have ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2011
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-011-0128-6